Synthesis of quantum circuits based on incompletely specified functions and if-decision diagrams

The problem of synthesis and optimisation logical reversible quantum circuits from functional descriptions represented as decision diagrams is considered. It one the key problems being solved with aim creating computing technology computers. A new method stepwise transformation initial specification to a circuit proposed, which provides for following project states: reduced ordered binary diagram, if-decision circuit. novelty consists in extending Shannon Davio expansions Boolean function on single variable same another obtaining decomposition products that are by incompletely defined functions. Uncertainty gives remarkable opportunities minimising graph representation specified function. Instead two outgoing branches diagram vertex, three if-diagram vertex generated, increase level parallelism circuits. For each step, appropriate mapping rules proposed reduce number lines, gates depth comparison results given known vertices into cascades shows significant improvement quality synthesised method.